Graph immersions with parallel cubic form

نویسندگان

چکیده

We consider non-degenerate graph immersions into affine space An+1 whose cubic form is parallel with respect to the Levi-Civita connection of metric. There exists a correspondence between such and pairs (J,?), where J an n-dimensional real Jordan algebra ? trace on J. Every immersion can be extended complete symmetric covering maximal connected component zero in set quasi-regular elements It improper hypersphere if only corresponding nilpotent. In this case it complete, Euclidean immersion, polynomial as globally defining function. classify all hyperspheres up dimension 5. As special we describe Cayley hypersurfaces quotient algebras. Our algebraic approach used study also other classes form.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Centroaffine Surfaces with parallel traceless Cubic Form

In this paper, we classify the centroaffine surfaces with parallel cubic Simon form and the centroaffine minimal surfaces with complete positive definite flat metric.

متن کامل

Finite groups admitting a connected cubic integral bi-Cayley graph

A graph   is called integral if all eigenvalues of its adjacency matrix  are integers.  Given a subset $S$ of a finite group $G$, the bi-Cayley graph $BCay(G,S)$ is a graph with vertex set $Gtimes{1,2}$ and edge set ${{(x,1),(sx,2)}mid sin S, xin G}$.  In this paper, we classify all finite groups admitting a connected cubic integral bi-Cayley graph.

متن کامل

Parallel Graph Mining with GPUs

Frequent graph mining is an important though computationally hard problem because it requires enumerating possibly an exponential number of candidate subgraph patterns, and checking their presence in a database of graphs. In this paper, we propose a novel approach for parallel graph mining on GPUs, which have emerged as a relatively cheap but powerful architecture for general purpose computing....

متن کامل

Linköping: Cubic-Time Graph Parsing with a Simple Scoring Scheme

We turn the Eisner algorithm for parsing to projective dependency trees into a cubictime algorithm for parsing to a restricted class of directed graphs. To extend the algorithm into a data-driven parser, we combine it with an edge-factored feature model and online learning. We report and discuss results on the SemEval-2014 Task 8 data sets (Oepen et al., 2014).

متن کامل

A Normal Form for Cubic Surfaces

We consider cubic surfaces with rational coefficients that contain a rational point and satisfy a certain condition regarding their coefficients. Each such cubic surface is shown to be birationally equivalent to a surface of the form z2 = f(x, y), where f(x, y) is a polynomial of degree at most 4. Our method is similar to that which Tate and Silverman used in [2] to put cubic curves into Weiers...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Differential Geometry and Its Applications

سال: 2021

ISSN: ['1872-6984', '0926-2245']

DOI: https://doi.org/10.1016/j.difgeo.2020.101700